Coloring the square of graphs whose maximum average degree is less than 4
نویسندگان
چکیده
منابع مشابه
An oriented coloring of graphs with maximum average degree less than
An oriented k-coloring of an oriented graph G is a homomorphism from G to an oriented graph H of order k. We prove that every oriented graph with maximum average degree less than 10 3 has an oriented chromatic number at most 16. This implies that every oriented planar graph with girth at least five has an oriented chromatic number at most 16, that improves the previous known bound of 19 due to ...
متن کاملIncidence coloring of graphs with high maximum average degree
An incidence of an undirected graph G is a pair (v, e) where v is a vertex of G and e an edge of G incident with v. Two incidences (v, e) and (w, f) are adjacent if one of the following holds: (i) v = w, (ii) e = f or (iii) vw = e or f . An incidence coloring of G assigns a color to each incidence of G in such a way that adjacent incidences get distinct colors. In 2005, Hosseini Dolama et al. [...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملAcyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree
A k-colouring of a graph G is a mapping c from the set of vertices of G to the set {1, . . . , k} of colours such that adjacent vertices receive distinct colours. Such a k-colouring is called acyclic, if for every two distinct colours i and j, the subgraph induced by all the edges linking a vertex coloured with i and a vertex coloured with j is acyclic. In other words, every cycle in G has at l...
متن کاملTuza's Conjecture for graphs with maximum average degree less than 7
Suppose that I wish to make a graph G triangle-free by removing a small number of edges. An obvious obstruction is the presence of a large set of edge-disjoint triangles, since I must remove one edge from each triangle. On the other hand, removing all the edges in a maximal set of edge-disjoint triangles clearly makes G triangle-free. Tuza’s Conjecture states that the worstcase number of edges ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.11.012